Perfect linear complexity profile and apwenian sequences
نویسندگان
چکیده
منابع مشابه
On Sequences with a Perfect Linear Complexity Profile
We derive Bézout identities for the minimal polynomials of a finite sequence and use them to prove a theorem of Wang and Massey on binary sequences with a perfect linear complexity profile. We give a new proof of Rueppel’s conjecture and simplify Dai’s original proof. We obtain short proofs of results of Niederreiter relating the linear complexity of a sequence s and K(s), which was defined usi...
متن کاملAbout the linear complexity of the almost perfect sequences
We calculate the linear complexity of almost perfect binary sequences. Also we study the linear complexity of binary sequences obtained from series of almost perfect ternary sequences and the ternary sequences with two nonzero autocorrelation sidelobe levels. Key–Words: linear complexity, almost perfect sequences
متن کاملThe Linear Complexity Profile and the Jump Complexity of Keystream Sequences
HARALD NIEDERREITER Institute for Information Processing Austrian Academy of Sciences Sonnenfelsgasse 19, A-10lO Vienna, Austria We study the linear complexity profile and the jump complexity of keystream sequences in arbitrary finite fields. We solve counting problems connected with the jump complexity, establish formulas for the expected value and the variance of the jump complexity, and prov...
متن کاملLinear complexity of transformed sequences
This paper deals with the effect of bit change errors on the linear complexity of finite sequences. Though a change in a single bit can cause a large change in linear complexity, it is shown that on the average the change will be small even when many bits, e.g. 10%, are changed. General bijections on the set of sequences of length n are studied and tight bounds are found on the average differen...
متن کاملOn the linear complexity profile of some sequences derived from elliptic curves
For a given elliptic curve E over a finite field of odd characteristic and a rational function f on E we first study the linear complexity profiles of the sequences f(nG), n = 1, 2, . . . which complements earlier results of Hess and Shparlinski. We use Edwards coordinates to be able to deal with many f where Hess and Shparlinski’s result does not apply. Moreover, we study the linear complexiti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2020
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2020.101761